Term Graph Narrowing 3
نویسنده
چکیده
We introduce term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing combines term graph rewriting with rst-order term uniication. Our main result is that this mechanism is complete for all term rewriting systems over which term graph rewriting is normalizing and connuent. This includes, in particular, all convergent term rewriting systems. Completeness means that for every solution of a given equation, term graph narrowing can nd a more general solution. The general motivation for using term graphs instead of terms is to improve eeciency: sharing common subterms saves space and avoids the repetition of computations.
منابع مشابه
Complete Strategies for Term Graph Narrowing
Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are often implemented on graph-like data structures to exploit sharing of common subexpressions. In this paper, we study the completeness of narrowing in graph-based implementations. We show that the well-known condition for the comple...
متن کاملSolving Equations by Graph Transformation
We review the concept of term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing combines term graph rewriting with rst-order term uni cation. This mechanism is complete for all term rewriting systems over which term graph rewriting is normalizing and conuent. This includes, in particular, all convergent term rewriting systems. Completen...
متن کاملUniication, Rewriting, and Narrowing on Term Graphs 1
The concept of graph substitution recently introduced by the authors is applied to term graphs, yielding a uniform framework for uniication, rewriting, and narrowing on term graphs. The notion of substitution allows deenitions of these concepts that are close to the corresponding deenitions in the term world. The rewriting model obtained in this way is equivalent to \collapsed tree rewriting" a...
متن کاملA Finite Representation of the Narrowing Space
Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite graph that still represents all the narrowing derivations. Furthermore, we introduce...
متن کاملThe Implementation of Lazy Narrowing
Lazy narrowing has been proposed as the operational model of functional logic languages. This paper presents a new abstract machine which implements lazy narrowing. The core of this machine consists of a conventional stack based architecture like the one used for imperative languages. Almost orthogonal extensions of this core implement the diierent concepts of functional logic languages. This s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996